Fe b 20 04 Parrondo ’ s games and the zipping algorithm
نویسنده
چکیده
We study the relation between the discrete–time version of the flashing ratchet known as Parrondo's games and a compression technique used very recently with thermal ratchets for evaluating the transfer of information – negentropy – between the Brownian particle and the source of fluctuations. We present some results concerning different versions of Parrondo's games, showing all of them a good qualitative agreement between the gain and the inverse of the entropy.
منابع مشابه
] 1 7 Fe b 20 03 Parrondo ’ s games as a discrete
We write the master equation describing the Parrondo’s games as a consistent discretization of the Fokker–Planck equation for an overdamped Brownian particle describing a ratchet. Our expressions, besides giving further insight on the relation between ratchets and Parrondo’s games, allow us to precisely relate the games probabilities and the ratchet potential such that periodic potentials corre...
متن کاملParrondo Games and Quantum Algorithms
We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect in which the player can ‘win’ via random reflections and rotations of the state-vector, and connect these to known quantum algorithms. [email protected]...
متن کاملApplications of Genetic Algorithm on Optimal Sequence for Parrondo Games
Parrondo game, which introduction is inspired by the flashing Brownian ratchet, presents an apparently paradoxical situation where there are ways to combine two losing games into a winning one. The original Parrondo game consists of two individual games, game A and game B. Game A is a slightly losing coin-tossing game. Game B has two coins, with an integer parameter M. If the current cumulative...
متن کاملOptimal sequence for Parrondo games
An algorithm based on backward induction is devised in order to compute the optimal sequence of games to be played in Parrondo games. The algorithm can be used to find the optimal sequence for any finite number of turns or in the steady state, showing that ABABB... is the sequence with the highest steady state average gain. The algorithm can also be generalized to find the optimal adaptive stra...
متن کاملAnalytical Expressions for Parrondo Games
We present some new analytical expressions for the so-called Parrondo effect, where simple coin-flipping games with negative expected value are combined into a winning game. Parrondo games are state-dependent. By identifying the game state variable, we can compute the stationary game state probabilities. Mixing losing games increases the probability of entering into a game state with positive v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004